The Distribution of Prime Numbers

نویسندگان

  • K. Soundararajan
  • K. SOUNDARARAJAN
چکیده

The prime number theorem tells us that π(x), the number of primes below x, is ∼ x/ logx. Equivalently, if pn denotes the n-th smallest prime number then pn ∼ n logn. What is the distribution of the gaps between consecutive primes, pn+1 − pn? We have just seen that pn+1 − pn is approximately logn “on average”. How often do we get a gap of size 2 logn, say; or of size 1 2 logn? One way to make this question precise is to fix an interval [α, β] (with 0 ≤ α < β) and ask for

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 6 N ov 1 99 8 On the nonasymptotic prime number distribution ∗

The objective of this paper is to introduce an approach to the study of the nonasymptotic distribution of prime numbers. The natural numbers are represented by theorem 1 in the matrix form N . The first column of the infinite matrix N starts with the unit and contains all composite numbers in ascending order. The infinite rows of this matrix except for the first elements contain prime numbers o...

متن کامل

Universal characteristics of fractal fluctuations in prime number distribution

The frequency of occurrence of prime numbers at unit number spacing intervals exhibits selfsimilar fractal fluctuations concomitant with inverse power law form for power spectrum generic to dynamical systems in nature such as fluid flows, stock market fluctuations, population dynamics, etc. The physics of long-range correlations exhibited by fractals is not yet identified. A recently developed ...

متن کامل

The Set of Prime Numbers *

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime candidates are obtained in terms of the first perfect number. The asymptotic behaviour is also considered. We obtain for the first time an explicit relation for g...

متن کامل

Sieve Methods

Preface Sieve methods have had a long and fruitful history. The sieve of Eratosthenes (around 3rd century B.C.) was a device to generate prime numbers. Later Legendre used it in his studies of the prime number counting function π(x). Sieve methods bloomed and became a topic of intense investigation after the pioneering work of Viggo Brun (see [Bru16],[Bru19], [Bru22]). Using his formulation of ...

متن کامل

Toward a dynamical model for prime numbers

We show one possible dynamical approach to the study of the distribution of prime numbers. Our approach is based on two complexity methods, the Computable Information Content and the Entropy Information Gain, looking for analogies between the prime numbers and intermittency.

متن کامل

Divisors of Mersenne Numbers By Samuel

We add to the heuristic and empirical evidence for a conjecture of Gillies about the distribution of the prime divisors of Mersenne numbers. We list some large prime divisors of Mersenne numbers Mp in the range 17000 < p < 105.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995